Applying Search in an Automatic Contract-Based Testing Tool Alexey Kolesnichenko, Christopher M. Poskitt, and Bertrand Meyer ETH Z¨ urich, Switzerland

Source URL: se.inf.ethz.ch

• Software engineering
• Software testing
• Computing
• Theoretical computer science
• Formal methods
• Logic in computer science
• Object-oriented programming
• Postcondition
• Random testing
• Eiffel
• General-purpose computing on graphics processing units
• Test data generation

Planning ”Fireworks” Trajectories for Steerable Medical Needles to Reduce Patient Trauma Jijie Xu1 , Vincent Duindam2 , Ron Alterovitz3 , Jean Pouliot4 , J. Adam M. Cunha4 , I-Chow Joe Hsu4 and Ken Goldberg2 Abstract

Source URL: goldberg.berkeley.edu

• Search algorithms
• Robot navigation
• Motion planning
• Theoretical computer science
• Rapidly-exploring random tree
• Needle
• Linear programming
• Nearest neighbor search

Extracting Route Directions from Web Pages Xiao Zhang? , Prasenjit Mitra?† , Sen Xu‡ , Anuj R. Jaiswal† , Alex Klippel‡ , Alan MacEachren‡ ? Department of Computer Science and Engineering

Source URL: www.cognitivegiscience.psu.edu

• Natural language processing
• Machine learning
• Markov models
• Computational linguistics
• Data mining
• Information extraction
• Part-of-speech tagging
• Search engine indexing
• Conditional random field
• Speech recognition
• Sentence
• Bag-of-words model

A Framework for Locally Convergent Random-Search Algorithms for Discrete Optimization via Simulation L. JEFF HONG The Hong Kong University of Science and Technology and

Source URL: users.iems.northwestern.edu

The Height of a Random Binary Search Tree BRUCE REED McGill University, Montreal Quebec, Canada and CNRS, Paris, France Abstract. Let Hn be the height of a random binary search tree on n nodes. We show that there exist c

Source URL: cgm.cs.mcgill.ca

Planning via Random Walk-Driven Local Search Fan Xie and Hootan Nakhost and Martin Müller Computing Science, University of Alberta Edmonton, Canada {fxie2,nakhost,mmueller}@ualberta.ca

Source URL: webdocs.cs.ualberta.ca

Quantization of random walks: Search algorithms and hitting time Miklos Santha1,2 1 2

Source URL: www.liafa.univ-paris-diderot.fr

Sampling-based Path Planning on Configuration-Space Costmaps L´eonard Jaillet, Juan Cort´es and Thierry Sim´eon Abstract—This paper addresses path planning considering a cost function defined over the configuration

Source URL: homepages.laas.fr

• Search algorithms
• Mathematics
• Routing algorithms
• Information science
• Information retrieval
• Edsger W. Dijkstra
• Combinatorial optimization
• Robot navigation
• A* search algorithm
• Shortest path problem
• Motion planning
• Rapidly-exploring random tree

Random Search for Hyper-Parameter Optimization James Bergstra and Yoshua Bengio February 10, 2011 Many machine learning algorithms have hyperparameters - flags, values, and other configuration information that guides the

Source URL: snowbird.djvuzone.org

Popularity-Biased Random Walks for Peer-to-Peer Search under the Square-Root Principle Ming Zhong Kai Shen

Source URL: iptps06.cs.ucsb.edu

• Mathematical analysis
• Probability theory
• Probability
• Graph theory
• Stochastic processes
• Random walk
• Pi
• Topology
• Random graph
• Markov chain
• Randomness
• Biased random walk on a graph